Ma 134. Syllabus. Summer 2008.

 

Lectures:

Instructor: Pavel Dubovski, pdubovsk @ stevens

134A: MTWTh 10:00-11:25  Pierce 116.

Office hours: Kidde 226,  MTW 1-2pm and by appointment.

 

Textbook:

[1] Rosen, K.H., “Discrete Mathematics and its Applications”, 6th edition (McGraw Hill).

 

 

  1. Logic (1.1-1.5, 11.1-11.2)
  2. Methods of proof (1.6-1.7)
  3. Sets (2.1-2.2)
  4. Functions, sequences, and cardinality (2.3-2.4)
  5. Growth of functions, Complexity of algorithms  (3.1-3.3)
  6. Elements of Number theory and Cryptology (3.4-3.7)
  7. Mathematical Induction (4.1-4.2)
  8. Recursion and program correctness (4.3-4.5)
  9. Counting (5.1-5.6, 7.1-7.6)
  10. Relations (8.1-8.6)
  11. Graph Theory (9.1-9.8, 10.1, 10.2)

 

 

Grading:

Quizzes: 50%

Final (cumulative) – 50%

Bonuses (class activity and bonus problems) – up to 5%

 

Hw assignments:

Before solving problems, please READ the corresponding section.

Hw1:

1.1  # 10, 11, 27, 28, 37, 38

1.2  # 5, 11, 22, 44, 46, 47, 51, 52

1.3   # 2, 7, 12, 20, 21, 31, 41, 45, 49.

 

Hw2:

1.3# 52, 53, 54, 59, 61.

1.4   # 15, 21, 31, 37, 40, 49, 50.

1.5  35

1.6  10, 13, 15, 26, 31